A Data-parallel Algorithm for Minimum-width Tree Layout and Its Proofs
نویسنده
چکیده
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved by a data-parallel algorithm. It takes O (height * log width ) time on width pro33333333333333333333333333333 This work was supported in part by National Science Council, Taiwan, R.O.C. under grants NSC 84-2213-E-009-043 and NSC 85-2213-E-009-051. cessors when proper communication links between processors are available, where height and width are the height and width of the tree, respectively. The layout calculated by the algorithm has the minimum width. After studying the proofs of correctness and the minimum-width property of the layout algorithm, we propose some guidelines concerning the formulation and the proof of data-parallel algorithms in general.
منابع مشابه
A Data-Parallel Algorithm for Minimum-Width Tree Layout
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved with a data-parallel algorithm. It takes O (height * log width ) time on width processors when proper communication links between processors are ava...
متن کاملIntegrated VLSI layout compaction and wire balancing on a shared memory multiprocessor: evaluation of a parallel algorithm
We first present a unged formulation to three problems in VLSI physical design: Layout compaction, Wire balancing and Integrated layout compaction and wire balancing problems. The aim of layout compaction is to achieve minimum chip width. Whereas wire balancing seeks to achieve minimum total wire length, integrated layout compaction and wire balancing seeks to minimize wire length maintaining t...
متن کاملLayout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A threedimensional (straight-line grid) drawing of a graph represents the vertices by points in Z and the edges by non-crossing line-segments. This paper ...
متن کاملQueue Layouts, Tree-Width, and Three-Dimensional Graph Drawing
A three-dimensional (straight-line grid) drawing of a graph represents the vertices by points in Z3 and the edges by non-crossing line segments. This research is motivated by the following open problem due to Felsner, Liotta, and Wismath [Graph Drawing ’01, Lecture Notes in Comput. Sci., 2002]: does every n-vertex planar graph have a three-dimensional drawing with O(n) volume? We prove that thi...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کامل